A Diophantine Problem with Unlike Powers of Primes
نویسندگان
چکیده
Let k be an integer with id="M2"> 4 ≤ 6 and id="M3"> η any real number. Suppose that id="M4"> λ 1 , 2 … 5 are nonzero numbers, not all of them have the same sign, id="M5"> / is irrational. It proved inequality id="M6"> p + 3 < open="(" close=")" max j − σ has infinitely many solutions in prime variables id="M7"> , where id="M8"> 0 36 189 id="M9"> 54 . This gives improvement recent results.
منابع مشابه
Diophantine approximation with primes and powers of two
We investigate the values taken by real linear combinations of two primes and a bounded number of powers of two. Under certain conditions, we are able to demonstrate that these values can be made arbitrarily close to any real number by taking sufficiently many powers of two.
متن کاملA pr 2 00 9 On a Diophantine problem with two primes and s powers of two
We refine a recent result of Parsell [20] on the values of the form λ 1 p 1 + λ 2 p 2 + µ 1 2 m 1 + · · · + µ s 2 m s , where p 1 , p 2 are prime numbers, m 1 ,. .. , m s are positive integers, λ 1 /λ 2 is negative and irrational and λ 1 /µ 1 , λ 2 /µ 2 ∈ Q.
متن کامل2 N ov 2 00 8 On a Diophantine problem with two primes and s powers of two
We refine a recent result of Parsell [22] on the values of the form λ 1 p 1 + λ 2 p 2 + µ 1 2 m 1 + · · · + µ s 2 m s , where p 1 , p 2 are prime numbers, m 1 ,. .. , m s are positive integers, λ 1 /λ 2 is negative and irrational and λ 1 /µ 1 , λ 2 /µ 2 ∈ Q.
متن کاملDiophantine Sets, Primes, and the Resolution of Hilbert’s 10th Problem
The term recursively enumerable set has its roots in logic but today is most commonly seen in reference to the theory of Turing machines. The Turing machine model is conceptually a very simple one for an abstract computing device but has been proved to be so powerful that many believe that that which is “computable” or “recursive” in any reasonable sense of the word is computable by some Turing...
متن کاملDiophantine Approximation by Primes
We show that whenever δ > 0 and constants λi satisfy some necessary conditions, there are infinitely many prime triples p1, p2, p3 satisfying the inequality |λ0 + λ1p1 + λ2p2 + λ3p3| < (max pj)−2/9+δ. The proof uses Davenport–Heilbronn adaption of the circle method together with a vector sieve method. 2000 Mathematics Subject Classification. 11D75, 11N36, 11P32.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics
سال: 2021
ISSN: ['2314-4785', '2314-4629']
DOI: https://doi.org/10.1155/2021/5528753